On Logic of Formal Provability and Explicit Proofs
نویسنده
چکیده
In 1933, Gödel considered two modal approaches to describing provability. One captured formal provability and resulted in the logic GL and Solovay’s Completeness Theorem. The other was based on the modal logic S4 and led to Artemov’s Logic of Proofs LP. In this paper, we study introduced by the author logic GLA, which is a fusion of GL and LP in the union of their languages. GLA is supplied with a Kripke-style semantics and the corresponding completeness theorem. Soundness and completeness of GLA with respect to the arithmetical provability semantics is established.
منابع مشابه
On Two Models of Provability
Gödel’s modal logic approach to analyzing provability attracted a great deal of attention and eventually led to two distinct mathematical models. The first is the modal logic GL, also known as the Provability Logic, which was shown in 1979 by Solovay to be the logic of the formal provability predicate. The second is Gödel’s original modal logic of provability S4, together with its explicit coun...
متن کاملExplicit Modal Logic
In 1933 Godel introduced a modal logic of provability (S4) and left open the problem of a formal provability semantics for this logic. Since then numerous attempts have been made to give an adequate provability semantics to Godel's provability logic with only partial success. In this paper we give the complete solution to this problem in the Logic of Proofs (LP). LP implements Godel's sugges...
متن کاملExplicit Proofs in Formal Provability Logic
In this paper we answer the question what implicit proof assertions in the provability logic GL can be realized by explicit proof terms. In particular we show that the fragment of GL which can be realized by generalized proof terms of GLA is exactly S4∩GL and equals the fragment that can be realized by proof-terms of LP. Additionally we show that the problem of determining which implicit provab...
متن کاملTR-2004011: Logic of Knowledge with Justifications from the Provability Perspective
An issue of a logic of knowledge with justifications has been discussed since the early 1990s. Such a logic along with the usual knowledge operator 2F “F is known” should contain assertions t:F “t is an evidence of F”. In this paper we build two systems of logic of knowledge with justifications: LPS4, which is an extension of the basic epistemic logic S4 by an appropriate calculus of evidences ...
متن کاملTableaux for the Logic of Proofs
The Logic of Proofs, LP, is an explicit provability logic due to Artemov. The introduction of LP answered a long-standing question concerning the intended semantics of Gödel’s provability calculus and provability semantics for intuitionistic logic. The explicit nature of LP and its ability to naturally represent both modal logic and typed λcalculi, especially in light of the Curry-Howard Isomor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1405.2559 شماره
صفحات -
تاریخ انتشار 2014